Factorization of the tenth Fermat number

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factorization of the tenth Fermat number

We describe the complete factorization of the tenth Fermat number F10 by the elliptic curve method (ECM). F10 is a product of four prime factors with 8, 10, 40 and 252 decimal digits. The 40-digit factor was found after about 140 Mflop-years of computation. We also discuss the complete factorization of other Fermat numbers by ECM, and summarize the factorizations

متن کامل

Factorization of the Tenth and Eleventh Fermat Numbers

We describe the complete factorization of the tenth and eleventh Fermat numbers. The tenth Fermat number is a product of four prime factors with 8, 10, 40 and 252 decimal digits. The eleventh Fermat number is a product of five prime factors with 6, 6, 21, 22 and 564 decimal digits. We also note a new 27-decimal digit factor of the thirteenth Fermat number. This number has four known prime facto...

متن کامل

The Factorization of the Ninth Fermat Number

In this paper we exhibit the full prime factorization of the ninth Fermât number Fg = 2512 + 1 . It is the product of three prime factors that have 7, 49, and 99 decimal digits. We found the two largest prime factors by means of the number field sieve, which is a factoring algorithm that depends on arithmetic in an algebraic number field. In the present case, the number field used was Q(v^2). T...

متن کامل

The Fermat factorization method revisited

We consider the well known Fermat factorization method, we call the Fermat factorization equation the equation solved by it: P(x, y) = (x+ 2R) − y − 4N = 0; where N = p q > 0 is a RSA modulus with primes p and q supposed of equal length. This equation is a bivariate integer polynomial equation and we propose to solve it directly using Coppersmith’s methods for bivariate integer polynomials. As ...

متن کامل

The Twenty-second Fermat Number Is Composite

We have shown by machine proof that F22 = 22 +1 is composite. In addition, we reenacted Young and Buell's 1988 resolution of F20 as composite, finding agreement with their final Selfridge-Hurwitz residues. We also resolved the character of all extant cofactors of Fn , n < 22, finding no new primes, and ruling out prime powers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1999

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-99-00992-8